Deterministic inverse zero-patterns

Deterministic second-order patterns

Second-order patterns, together with second-order matching, enable concise specification of program transformation, and have been implemented in several program transformation systems. However, second-order matching in general is nondeterministic, and the matching algorithm is so expensive that the matching is NP-complete. It is orthodox to impose constraints on the form of higher-order pattern...

Inverse zero-sum problems and algebraic invariants

— In this article, we study the maximal cross number of long zero-sumfree sequences in a finite Abelian group. Regarding this inverse-type problem, we formulate a general conjecture and prove, among other results, that this conjecture holds true for finite cyclic groups, finite Abelian p-groups and for finite Abelian groups of rank two. Also, the results obtained here enable us to improve, via ...

Inverse Zero - Sum Problems Ii Wolfgang

Let G denote a finite abelian group. The Davenport constant D(G) is the smallest integer such that each sequence over G of length at least D(G) has a non-empty zero-sum subsequence, i.e., the sum of the terms equals 0 ∈ G. The constants s(G) and η(G) are defined similarly; the additional condition that the length of the zero-sum subsequence is equal to (not greater than, resp.) the exponent of ...

A Zero-One Law for Deterministic 2-Party Secure Computation

We use security in the Universal Composition framework as a means to study the “cryptographic complexity” of 2-party secure computation tasks (functionalities). We say that a functionality F reduces to another functionality G if there is a UC-secure protocol for F using ideal access to G. This reduction is a natural and fine-grained way to compare the relative complexities of cryptographic task...

Deterministic Higher-Order Patterns for Program Transformation